Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles

An acyclic edge coloring of a graph G is proper such that no bichromatic cycles are produced. The conjecture by Fiamčik (1978) and Alon, Sudakov Zaks (2001) states every simple with maximum degree Δ acyclically ( + 2 ) -colorable. Despite many milestones, the remains open even for planar graphs. In this paper, we confirm affirmatively on graphs without intersecting triangles. We do so first showing, discharging methods, triangles must have at least one six specified groups local structures, then proving recoloring certain edges in each structure induction number graph. • Consider long-standing coloring. Show triangles, holds true. Adapt methods to reduce structures only groups. Design re-coloring techniques group prove number.